Message Transmission with Reverse Firewalls - Secure Communication on Corrupted Machines

نویسندگان

  • Yevgeniy Dodis
  • Ilya Mironov
  • Noah Stephens-Davidowitz
چکیده

A secure reverse firewall, as recently defined by Mironov and Stephens-Davidowitz, is a third party that “sits between a user and the outside world” and modifies the user’s sent and received messages so that even if the user’s machine has been corrupted, her security is still guaranteed. In other words, reverse firewalls allow us to provide meaningful (and, indeed, very strong) security guarantees against powerful adversaries that may have tampered with the user’s hardware or software (or adversaries that are aware of bugs in the user’s protocol implementation). A long list of recent events and disclosures shows that such threats are extremely common in practice, and they present a serious, arguably existential, threat to cryptography. Importantly, reverse firewalls defend against such threats without sharing any secrets with the user, and in general we expect the user to place no more trust in the firewall than she places in her communication channel. While Mironov and Stephens-Davidowitz demonstrated that reverse firewalls can be constructed for very strong cryptographic primitives (which are of mostly theoretical interest), we study reverse firewalls for perhaps the most natural cryptographic task: secure message transmission. We find a rich structure of solutions that vary in efficiency, security, and setup assumptions, in close analogy with message transmission in the classical setting. Our strongest and most important result shows a protocol that achieves interactive, concurrent CCA-secure message transmission with a reverse firewall—i.e., CCA-secure message transmission on a possibly compromised machine! Surprisingly, this protocol is quite efficient and simple, requiring only a small constant number of public-key operations. It could easily be used in practice. Behind this result is a technical composition theorem that shows how key agreement with a sufficiently secure reverse firewall can be used to construct a message-transmission protocol with its own secure reverse firewall.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality

In this paper, we study the problem of probabilistic perfectly reliable message transmission (PPRMT) and probabilistic perfectly secure message transmission (PPSMT) between a sender S and a receiver R in a synchronous network, where S and R are connected by n vertex disjoint paths called wires. Some of these n wires may be corrupted by a mixed adversary (tb, to, tf , tp), having unbounded compu...

متن کامل

Towards Optimal and Efficient Perfectly Secure Message Transmission

Perfectly secure message transmission (PSMT), a problem formulated by Dolev, Dwork, Waarts and Yung, involves a sender S and a recipient R who are connected by n synchronous channels of which up to t may be corrupted by an active adversary. The goal is to transmit, with perfect security, a message from S to R. PSMT is achievable if and only if n > 2t. For the case n > 2t, the lower bound on the...

متن کامل

Network Connection and Perfectly Secure Message Transmission on Wireless Mobile Networks

In this paper we proposed perfectly secure message transmission for reliable and secure communications in order to ensure that an adversary cannot obtain information (in the information theoretic sense) about messages. There are numerous studies about the interplay of network connectivity and perfectly secure message transmission under a Byzantine adversary capable of corrupting up to t players...

متن کامل

Simple and Communication Complexity Efficient Almost Secure and Perfectly Secure Message Transmission Schemes

Recently Kurosawa and Suzuki considered almost secure (1phase n-channel) message transmission when n = (2t + 1). The authors gave a lower bound on the communication complexity and presented an exponential time algorithm achieving this bound. In this paper we present a polynomial time protocol achieving the same security properties for the same network conditions. Additionally, we introduce and ...

متن کامل

Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary

In this paper, we study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous network, a part of which is under the influence of an all powerful mobile Byzantine adversary. We design a three phase bit optimal PSMT protocol tolerating mobile adversary, whose communication complexity ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2015  شماره 

صفحات  -

تاریخ انتشار 2015